3.9 KB · ⇊ 3 parts · ⤓ Micron 3.9 KB · ⤓ HTML 14.2 KB

top

BNR Prolog, also known as CLP(BNR), is a declarative constraint logic programming language based on relational interval arithmetic developed at Bell-Northern Research in the 1980s and 1990s. Embedding relational interval arithmetic in a logic programming language differs from other constraint logic programming (CLP) systems like CLP(R) or Prolog-III in that it does not perform any symbolic processing. BNR Prolog was the first such implementation of interval arithmetic in a logic programming language.cite-ref-1[1] Since the constraint propagation is performed on real interval values, it is possible to express and partially solve non-linear equations.cite-ref-2[2]

• Example rule

• See also

• References

• General references

• External links

The simultaneous equations:

tan ⁡ ⁡ x = y {\displaystyle \tan x=y}

x 2 + y 2 = 5 {\displaystyle x^{2}+y^{2}=5}

are expressed in CLP(BNR) as:

and a typical implementation's response would be:

• Comparison of Prolog implementations

• Prolog syntax and semantics

cite-note-11. ↑ citerefrossivan-beekwalsh2006Rossi, Francesco; Van Beek, Peter; Walsh, Toby, eds. (2006). Handbook of constraint programming (Hardback). Elsevier. ISBN 9780444527264.

cite-note-22. ↑ citerefjaffarmaher1994Jaffar, Joxan; Maher, Michael J. (1994). "Constraint logic programming: a survey". The Journal of Logic Programming. 19–20. Elsevier: 503–581. doi:10.1016/0743-1066(94)90033-7.

• J. G. Cleary, "Logical Arithmetic", Future Computing Systems, Vol 2, No 2, pp. 125–149, 1987.

• W. Older and A. Vellino, "Extending Prolog with Constraint Arithmetic on Real Intervals", in Proc. of the Canadian Conf. on Electrical and Computer Engineering, 1990.

• Older, W., and Benhamou, F., Programming in CLP(BNR), in: 1st Workshop on Principles and Practice of Constraint Programming, 1993.

• GitHub site for a 2018 re-implementation in SWI-Prolog